Load balance and parallel I/O: Optimising COSA for large simulations
نویسندگان
چکیده
منابع مشابه
Improving the Load Balance of Parallel Adaptive Mesh Refined Simulations
In order to quickly take advantage of petascale machines, which are in the near future, we must improve the performance of current codes. In the past, general-purpose adaptive codes, such as Uintah, have been shown to scale to thousands of processors. However, in order to take advantage of petascale machines these codes will have to scale to hundreds of thousands of processors. One important as...
متن کاملLoad{balance in parallel FACR
Fourier Analysis Cyclic Reduction is a class of very eecient methods for the solution of Poisson's equation on regular grids. We show that exploiting the numerical properties of the tridiagonal systems involved may reduce the factorization work required to a few percent of a normal factorization. We also show that exploiting this property on distributed memory parallel processor architectures m...
متن کاملLarge Neural Simulations on Large Parallel Computers
Simulations of biologically realistic neurons in large densely connected networks pose many problems to application programmers, particularly on distributed memory computers. We discuss simulations of hundreds of thousands to millions of cells in a model of neocortex in the context of new computing platforms with many tens of thousands to hundreds of thousands of processing elements. We are de...
متن کاملFair load-balance on parallel systems for QoS
CISUC , Department of Informatic Engineering, University of Coimbra Portugal {lorleans, pnf}@dei.uc.pt Abstract: Many of the load-balancing algorithms used in parallel systems do not have a concern about response times: tasks (or requests) are simply dispatched to a server, which provides no guarantees about their execution times. When there is a maximum acceptable response time (i.e. deadline)...
متن کاملShape optimizing load balancing for MPI-parallel adaptive numerical simulations
Load balancing is important for the efficient execution of numerical simulations on parallel computers. In particular when the simulation domain changes over time, the mapping of computational tasks to processors needs to be modified accordingly. Most state-of-the-art libraries addressing this problem are based on graph repartitioning with a parallel variant of the Kernighan-Lin (KL) heuristic....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Fluids
سال: 2018
ISSN: 0045-7930
DOI: 10.1016/j.compfluid.2018.03.007